Between Hashed DH and Computational DH: Compact Encryption from Weaker Assumption

Between Hashed DH and Computational DH: Compact Encryption from Weaker Assumption

In this paper, we introduce the intermediate hashed Diffie-Hellman (IHDH) assumption which is weaker than the hashed DH (HDH) assumption (and thus the decisional DH assumption), and is stronger than the computational DH assumption. We then present two public key encryption schemes with short ciphertexts which are both chosen-ciphertext secure under this assumption. The short-message scheme has ...

Similarity DH-Algebras

In  cite{GL}, B. Gerla and I. Leuc{s}tean introduced the notion of similarity on MV-algebra. A similarity MV-algebra is an MV-algebra endowed with a binary operation $S$ that verifies certain additional properties. Also, Chirtec{s} in cite{C}, study the notion of similarity on L ukasiewicz-Moisil algebras. In particular, strong similarity L ukasiewicz-Moisil algebras were defined. In this paper...

Encryption from Weaker Assumptions

Scalable Attribute-Based Encryption Under the Strictly Weaker Assumption Family

Attribute-Based Encryption (ABE) is a special type of public key encryption that allows users to share sensitive data efficiently through fine-grained access control. The security involved in existing ABE systems is currently insufficient. These systems are usually built on the Decisional Bilinear Diffie-Hellman (DBDH) assumption or the q-type DBDH assumption, which is stronger than the DBDH as...

Digital Holography and Three Dimensional Imaging (DH)

We have investigated the image type full-color computer-generated hologram that has full parallax and can be reconstructed with three color LEDs. The object of the hologram is processed from 3D computer graphics polygon data and has shaded surface with hidden surface removal. The optical reconstructed image from the printed hologram is evaluated. © 2011 Optical Society of America OCIS codes: 09...